Killian's Operations

Three Graceful Operations

A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G a...

Applications of Graph Operations

In this paper, some applications of our earlier results in working with chemical graphs are presented.

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

Operations Research Transforms Baosteel's Operations

Operations

Dorette Morgan Senior HR Officer Dorieke van den Brom Senior HR Officer Sophie Colston HR Officer Jodie Hooper HR Adviser Charlotte Kerrigan HR Adviser Kerry Gault HR Administrator Beth Rogers HR Administrator Bex Upton HR Administrator Anna Woolford HR Administrator Dawn Freeman HR Officer Janet Cainey HR Adviser Kate Brown Acting HR Adviser Mary Alexandrou HR Administrator Amber Pinckney HR A...